An Almost Linear-Time Algorithm for Graph Realization
نویسندگان
چکیده
منابع مشابه
An (almost) Linear Time Algorithm For Odd Cycles Transversal∗
We consider the following problem, which is called the odd cycles transversal problem. Input: A graph G and an integer k. Output : A vertex set X ∈ V (G) with |X| ≤ k such that G−X is bipartite. We present an O(mα(m, n)) time algorithm for this problem for any fixed k, where n, m are the number of vertices and the number of edges, respectively, and the function α(m, n) is the inverse of the Ack...
متن کاملAn almost-linear time and linear space algorithm for the longest common subsequence problem
There are two general approaches to the longest common subsequence problem. The dynamic programming approach takes quadratic time but linear space, while the non-dynamic-programming approach takes less time but more space. We propose a new implementation of the latter approach which seems to get the best for both time and space for the
متن کاملAn Algorithm for Multi-Realization of Nonlinear MIMO Systems
This paper presents a theoretical approach to implementation of the “Multi-realization of nonlinear MIMO systems”. This method aims to find state-variable realization for a set of systems, sharing as many parameters as possible. In this paper a special nonlinear multi-realization problem, namely the multi-realization of feedback linearizable nonlinear systems is considered and an algorithm for ...
متن کاملAN ALGORITHM FOR FINDING THE STABILITY OF LINEAR TIME-INVARIANT SYSTEMS
The purpose of this paper is to show that the ideas and techniques of the classical methods of finding stability, such as the criteria of Leonhard and Nyquist, can be used to derive simple algorithm to verify stability. This is enhanced by evaluating the argument of the characteristic equation of a linear system in the neighbourhood of the origin of the complex plane along the imaginary axis
متن کاملAn Almost Linear Time Approximation Algorithm for the Permanen of a Random (0-1) Matrix
We present a simple randomized algorithm for approximating permanents. The algorithm with inputs A, ǫ > 0 produces an output XA with (1−ǫ)per(A) ≤ XA ≤ (1+ǫ)per(A) for almost all (0-1) matrices A. For any positive constant ǫ > 0, and almost all (0-1) matrices the algorithm runs in time O(nω), i.e., almost linear in the size of the matrix, where ω = ω(n) is any function satisfying ω(n) → ∞ as n ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 1988
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.13.1.99